41 Counterexamples to property (B) of the discrete time bomber problem
نویسندگان
چکیده
منابع مشابه
the problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولSecond-order counterexamples to the discrete-time Kalman conjecture
The Kalman conjecture is known to be true for third-order continuous-time systems. We show that it is false in general for second-order discrete-time systems by construction of counterexamples with stable periodic solutions. We discuss a class of second-order discrete-time systems for which it is true provided the nonlinearity is odd, but false in general. This has strong implications for the a...
متن کاملHierarchical Counterexamples for Discrete-Time Markov Chains
This paper introduces a novel counterexample generation approach for the verification of discrete-time Markov chains (DTMCs) with two main advantages: (1) We generate abstract counterexamples which can be refined in a hierarchical manner. (2) We aim at minimizing the number of states involved in the counterexamples, and compute a critical subsystem of the DTMC whose paths form a counterexample....
متن کاملCounterexamples to the Fourteenth Problem of Hilbert
Let K be a field, K[X] = K[X1, . . . , Xn] the polynomial ring in n variables over K for some n ∈ N, and K(X) the field of fractions of K[X]. Assume that L is a subfield of K(X) containing K. Then, the Fourteenth Problem of Hilbert asks whether the Ksubalgebra L ∩K[X] of K[X] is finitely generated. Zariski [17] showed in 1954 that the answer to this problem is affirmative if the transcendence d...
متن کاملSome Results on the Bomber Problem
The problem of optimally allocating partially effective, defensive weapons against randomly arriving enemy aircraft so that a bomber maximizes its probability of reaching its designated target is considered in the usual continuous-time context, and in a discretetime context. The problem becomes that of determining the optimal number of missiles K(n,t) to use against an enemy aircraft encountere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2016
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-016-2265-6